If we used an inadmissible heuristic in A* tree search, could it change the completeness of the search?

No

Explanation:

If we used an inadmissible heuristic in A* tree search, it cannot  change the completeness of the search, and this is because as long as a heuristic function is bounded, then A* tree search would visit all the nodes available  and would definitely find a path to an existing goal

A* tree search is a  search strategy that is used to find and establish an efficient path between points, and the node in a search tree can be visited several times  as well

a  social news website  is an  internet  website  that features  user-posted stories. such stories are ranked based on popularity, as voted on by other users of the site or by website administrators. users typically comment online on the news posts and these comments may also be ranked in popularity. since their emergence with the birth of  web 2.0, social news sites have been used to link many types of information, including news, humor, support, and discussion. all such websites allow the users to submit content and each site differs in how the content is moderated. on the  slashdot  and  fark  websites,  administrators  decide which articles are selected for the front page. on  reddit  and  digg, the articles that get the most votes from the community of users will make it to the front page. many social news websites also feature an online comment system, where users discuss the issues raised in an article. some of these sites have also applied their voting system to the comments, so that the most popular comments are displayed first. some social news websites also have a  social networking  function, in that users can set up a user profile and follow other users' online activity on the website.