Register

Doubt in ordered tree and binary tree.

394 views

2 Answers

Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
1 answer
1
arya_stark asked Jul 4, 2018
2,831 views
Entriies in s stack are "ordered".
Entries in a stack are "ordered". What is the meaning of this statement?
Entries in a stack are "ordered". What is the meaning of this statement?
User Avatar
1 votes
1 votes
0 answers
2
Rohit Gupta 8 asked Dec 25, 2017
1,137 views
If the average depth of a node in an n-node binary search tree is O(lg n), then the height of the tree is
If the average depth of a node in an $n$-node binary search tree is $O(\log{n})$, then the height of the tree is$O(n\log{n})$$O(n)$$O(\log{n})$$O(\sqrt(n\log{n}))$
User Avatar
2 votes
2 votes
1 answer
3
vijaycs asked May 25, 2016
12,811 views
Minimum number of nodes in a full binary tree with height 3?
User Avatar
0 votes
0 votes
1 answer
4
tamil93 asked Feb 3, 2016
815 views
Maximum number of nodes in binary tree
User Avatar
Link Copied!