retagged by
1,363 views
2 votes
2 votes

Traversing a binary tree first root and then left and right subtrees called ______ traversal.

  1. postorder.
  2. preorder.
  3. inorder.
  4. none of these.
retagged by

1 Answer

Answer:

Related questions

2 votes
2 votes
2 answers
1
admin asked Apr 2, 2020
781 views
A full binary tree with $n$ non-leaf nodes contains$\log_ 2 n$ nodes$n+1$ nodes$2n$ nodes$2n+1$ nodes
8 votes
8 votes
10 answers
2
admin asked Mar 31, 2020
2,284 views
Which of the following logic expression is incorrect?$1\oplus0=1$$1\oplus1\oplus0=1$$1\oplus1\oplus1=1$$1\oplus1=0$
3 votes
3 votes
3 answers
3
admin asked Mar 31, 2020
3,870 views
In which of the following adder circuits, the carry look ripple delay is eliminated?Half adderFull adderParallel adderCarry-look ahead adder
3 votes
3 votes
2 answers
4
admin asked Mar 31, 2020
1,024 views
The output of a sequential circuit depends on present inputs onlypast inputs onlyboth present and past inputspresent outputs only