Search results

Page title matches

• Undirected tree
  120 bytes (17 words) - 21:56, 6 October 2014
• Directed Tree
  # A '''directed tree''' is a directed graph <math>T = (V,A)</math> with a designated node <math> # A directed tree <math> T = (V,A)</math> is called '''binary''' if each node's outdegree is
  7 KB (1,284 words) - 11:29, 26 May 2015
• Search tree
  116 bytes (17 words) - 22:13, 6 October 2014
• B-tree
  [[Category:Tree]] [[Category:B-tree]]
  3 KB (541 words) - 13:49, 26 May 2015
• Decision Tree
  109 bytes (11 words) - 17:39, 10 September 2014
• B-tree: find
  [[Category:B-Tree]] '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to a B-tree node of key type <math>\mathcal{K}</math>".
  3 KB (528 words) - 13:46, 3 March 2017
• B-tree: remove
  [[Category:B-Tree]] ...ath>p'</math>, <math>p_1</math> and <math>p_2</math> of type "pointer to B-tree node".
  10 KB (1,690 words) - 13:58, 3 March 2017
• B-tree: maximum
  '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to a B-tree node". # <math>p</math> points to some node <math>N</math> of the B-tree.
  835 bytes (136 words) - 11:21, 13 October 2014
• B-Tree:Remove
  #REDIRECT [[B-tree: remove]]
  28 bytes (3 words) - 08:43, 5 October 2014
• Binary search tree
  ...outube|https://www.youtube.com/watch?v=AdhRIRgVZVw|500|right|Binary search tree|frame}} [[File:Bst.png|300px|thumb|right|Simple Binary Search tree]]
  2 KB (353 words) - 06:14, 6 July 2015
• B-tree: minimum
  '''Auxiliary data:''' A pointer p of type "pointer to a B-tree node". # '''''p''''' points to some node '''''N''''' of the B-tree.
  735 bytes (107 words) - 11:22, 13 October 2014
• B-Tree:Insert
  #REDIRECT [[B-tree: insert]]
  28 bytes (3 words) - 08:44, 5 October 2014
• B-tree: split
  B-TREE-SPLIT-CHILD(''x'', ''i'')
  852 bytes (119 words) - 08:42, 5 October 2014
• B-Tree:Minimum
  #REDIRECT [[B-tree: minimum]]
  29 bytes (3 words) - 08:45, 5 October 2014
• B-tree: insert
  [[Category: B-Tree]] ...ta:''' Pointers <math>p</math> and <math>p'</math> of type "pointer to a B-tree node of key type <math>\mathcal{K}</math>."
  7 KB (1,135 words) - 13:47, 3 March 2017
• B-Tree:Find
  #REDIRECT [[B-tree: find]]
  26 bytes (3 words) - 08:45, 5 October 2014
• Minimum spanning tree
  ...sic graph definitions#Forests, trees, branchings, arborescences|undirected tree]] <math> T= (V,E_F)</math> such that <math>E_T \subseteq E</math>.
  539 bytes (79 words) - 12:33, 16 June 2015
• Red-Black Tree
  213 bytes (43 words) - 12:31, 11 September 2014
• Binary Search Tree
  #REDIRECT [[Binary search tree]]
  32 bytes (4 words) - 13:20, 5 October 2014
• Binary search tree: find
  ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Find</div> ...png|20px]][https://openlearnware.tu-darmstadt.de/#!/resource/binary-search-tree-1938 Openlearnware]<br>See Chapter 2,3</div>
  3 KB (425 words) - 13:38, 3 March 2017
• Binary Search Tree:Traverse
  #REDIRECT [[Binary search tree: traverse]]
  42 bytes (5 words) - 08:42, 5 October 2014
• Binary search tree: traverse
  [[Category:Tree Algorithms]] ...outube|https://www.youtube.com/watch?v=PXqM9q57BMk|500|right|Binary search tree: traverse|frame}}
  6 KB (959 words) - 13:41, 3 March 2017
• B-Tree:Split-Child
  #REDIRECT [[B-tree: split]]
  27 bytes (3 words) - 08:42, 5 October 2014
• Binary search tree: minimum
  [[File:Bst_min.png|300px|thumb|right|Binary search tree minimum path]] TREE-MINIMUM (x)
  172 bytes (28 words) - 16:13, 18 October 2014
• Multi-way search tree
  126 bytes (18 words) - 22:14, 6 October 2014
• Binary search tree: maximum
  [[File:Bst_max.png|300px|thumb|right|Binary search tree maximum path]] TREE-MAXiMUM (x)
  174 bytes (28 words) - 16:14, 18 October 2014
• Binary search tree: insert
  [[Category:Binary Search Tree]] ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Insert</div>
  4 KB (716 words) - 13:39, 3 March 2017
• Binary search tree: remove
  [[Category:Binary Search Tree]] ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Remove</div>
  5 KB (762 words) - 13:39, 3 March 2017
• Binary Search Tree:Find
  #REDIRECT [[Binary search tree: find]]
  38 bytes (5 words) - 08:40, 5 October 2014
• Binary Search Tree:Minimum
  #REDIRECT [[Binary search tree: minimum]]
  41 bytes (5 words) - 08:40, 5 October 2014
• Binary Search Tree:Maximum
  #REDIRECT [[Binary search tree: maximum]]
  41 bytes (5 words) - 08:41, 5 October 2014
• Binary Search Tree:Insert
  #REDIRECT [[Binary search tree: insert]]
  40 bytes (5 words) - 08:41, 5 October 2014
• Binary Search Tree:Remove
  #REDIRECT [[Binary search tree: remove]]
  40 bytes (5 words) - 08:41, 5 October 2014
• Binary Search Tree:Remove node
  #REDIRECT [[Binary search tree: remove node]]
  45 bytes (6 words) - 08:42, 5 October 2014
• B-tree: insert and rearrange
  [[Category:B-Tree]] # Three pointers <math>p, p_1, p_2 </math> of type "pointer to B-tree node".
  4 KB (689 words) - 23:19, 19 June 2015
• B-tree: merge two siblings
  [[Category:B-Tree]] # Three pointers <math>p, p_1, p_2 </math> of type "pointer to B-tree node".
  4 KB (724 words) - 23:19, 19 June 2015
• B-Tree:merge two Siblings
  #REDIRECT [[B-tree: merge two siblings]]
  40 bytes (5 words) - 08:44, 5 October 2014
• B-Tree:Insert and Rearrange
  #REDIRECT [[B-tree: insert and rearrange]]
  42 bytes (5 words) - 08:44, 5 October 2014
• Binary search tree: remove node
  [[Category:Binary Search Tree]] ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Remove node</div>
  3 KB (454 words) - 13:39, 3 March 2017
• B-Tree:Shift Key to Sibling
  #REDIRECT [[B-tree: shift key to sibling]]
  42 bytes (6 words) - 08:43, 5 October 2014
• B-tree: shift key to sibling
  [[Category:B-Tree]]
  4 KB (708 words) - 23:17, 19 June 2015

Page text matches

• Binary search tree: maximum
  [[File:Bst_max.png|300px|thumb|right|Binary search tree maximum path]] TREE-MAXiMUM (x)
  174 bytes (28 words) - 16:14, 18 October 2014
• Binary search tree: minimum
  [[File:Bst_min.png|300px|thumb|right|Binary search tree minimum path]] TREE-MINIMUM (x)
  172 bytes (28 words) - 16:13, 18 October 2014
• Binary search tree
  ...outube|https://www.youtube.com/watch?v=AdhRIRgVZVw|500|right|Binary search tree|frame}} [[File:Bst.png|300px|thumb|right|Simple Binary Search tree]]
  2 KB (353 words) - 06:14, 6 July 2015
• B-tree: minimum
  '''Auxiliary data:''' A pointer p of type "pointer to a B-tree node". # '''''p''''' points to some node '''''N''''' of the B-tree.
  735 bytes (107 words) - 11:22, 13 October 2014
• B-Trees
  #REDIRECT [[B-tree]]
  20 bytes (2 words) - 08:15, 5 October 2014
• B-tree: maximum
  '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to a B-tree node". # <math>p</math> points to some node <math>N</math> of the B-tree.
  835 bytes (136 words) - 11:21, 13 October 2014
• B-Tree:Remove
  #REDIRECT [[B-tree: remove]]
  28 bytes (3 words) - 08:43, 5 October 2014
• B-Tree:Insert
  #REDIRECT [[B-tree: insert]]
  28 bytes (3 words) - 08:44, 5 October 2014
• B-Tree:Minimum
  #REDIRECT [[B-tree: minimum]]
  29 bytes (3 words) - 08:45, 5 October 2014
• B-Tree:Find
  #REDIRECT [[B-tree: find]]
  26 bytes (3 words) - 08:45, 5 October 2014
• Binary Search Tree
  #REDIRECT [[Binary search tree]]
  32 bytes (4 words) - 13:20, 5 October 2014
• B-Tree:Split-Child
  #REDIRECT [[B-tree: split]]
  27 bytes (3 words) - 08:42, 5 October 2014
• Binary Search Tree:Find
  #REDIRECT [[Binary search tree: find]]
  38 bytes (5 words) - 08:40, 5 October 2014
• Binary Search Tree:Minimum
  #REDIRECT [[Binary search tree: minimum]]
  41 bytes (5 words) - 08:40, 5 October 2014
• Binary Search Tree:Maximum
  #REDIRECT [[Binary search tree: maximum]]
  41 bytes (5 words) - 08:41, 5 October 2014
• Binary Search Tree:Insert
  #REDIRECT [[Binary search tree: insert]]
  40 bytes (5 words) - 08:41, 5 October 2014
• Binary Search Tree:Remove
  #REDIRECT [[Binary search tree: remove]]
  40 bytes (5 words) - 08:41, 5 October 2014
• Binary Search Tree:Traverse
  #REDIRECT [[Binary search tree: traverse]]
  42 bytes (5 words) - 08:42, 5 October 2014
• B-Tree:merge two Siblings
  #REDIRECT [[B-tree: merge two siblings]]
  40 bytes (5 words) - 08:44, 5 October 2014
• B-Tree:Insert and Rearrange
  #REDIRECT [[B-tree: insert and rearrange]]
  42 bytes (5 words) - 08:44, 5 October 2014
• Binary Search Tree:Remove node
  #REDIRECT [[Binary search tree: remove node]]
  45 bytes (6 words) - 08:42, 5 October 2014
• B-tree
  [[Category:Tree]] [[Category:B-tree]]
  3 KB (541 words) - 13:49, 26 May 2015
• Main Page
  === Tree Algorithms === * [[B-tree: find]]
  4 KB (380 words) - 15:13, 30 November 2020
• B-Tree:Shift Key to Sibling
  #REDIRECT [[B-tree: shift key to sibling]]
  42 bytes (6 words) - 08:43, 5 October 2014
• Binary search tree: remove node
  [[Category:Binary Search Tree]] ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Remove node</div>
  3 KB (454 words) - 13:39, 3 March 2017
• B-tree: find
  [[Category:B-Tree]] '''Auxiliary data:''' A pointer <math>p</math> of type "pointer to a B-tree node of key type <math>\mathcal{K}</math>".
  3 KB (528 words) - 13:46, 3 March 2017
• Binary search tree: find
  ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Find</div> ...png|20px]][https://openlearnware.tu-darmstadt.de/#!/resource/binary-search-tree-1938 Openlearnware]<br>See Chapter 2,3</div>
  3 KB (425 words) - 13:38, 3 March 2017
• Binary search tree: insert
  [[Category:Binary Search Tree]] ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Insert</div>
  4 KB (716 words) - 13:39, 3 March 2017
• Binary search tree: remove
  [[Category:Binary Search Tree]] ...em;font-weight:bold;text-align: center;margin:0.2em 0 1em 0">Binary Search Tree<br>Remove</div>
  5 KB (762 words) - 13:39, 3 March 2017
• Directed Tree
  # A '''directed tree''' is a directed graph <math>T = (V,A)</math> with a designated node <math> # A directed tree <math> T = (V,A)</math> is called '''binary''' if each node's outdegree is
  7 KB (1,284 words) - 11:29, 26 May 2015
• B-tree: merge two siblings
  [[Category:B-Tree]] # Three pointers <math>p, p_1, p_2 </math> of type "pointer to B-tree node".
  4 KB (724 words) - 23:19, 19 June 2015
• B-tree: insert
  [[Category: B-Tree]] ...ta:''' Pointers <math>p</math> and <math>p'</math> of type "pointer to a B-tree node of key type <math>\mathcal{K}</math>."
  7 KB (1,135 words) - 13:47, 3 March 2017
• B-tree: remove
  [[Category:B-Tree]] ...ath>p'</math>, <math>p_1</math> and <math>p_2</math> of type "pointer to B-tree node".
  10 KB (1,690 words) - 13:58, 3 March 2017
• Binary search tree: traverse
  [[Category:Tree Algorithms]] ...outube|https://www.youtube.com/watch?v=PXqM9q57BMk|500|right|Binary search tree: traverse|frame}}
  6 KB (959 words) - 13:41, 3 March 2017
• Prim
  [[Category:Minimum spanning tree]] '''Algorithmic problem:''' [[Minimum spanning tree]]
  5 KB (901 words) - 09:28, 21 June 2015
• Minimum spanning tree
  ...sic graph definitions#Forests, trees, branchings, arborescences|undirected tree]] <math> T= (V,E_F)</math> such that <math>E_T \subseteq E</math>.
  539 bytes (79 words) - 12:33, 16 June 2015
• Heap as array: ascendItem
  ...that fulfills the heap property. Therefore the heap property for the whole tree is restored again. '''Proof:''' Follows immediately from the fact that the height of the heap tree is in <math>\Theta (log n)</math>.
  3 KB (584 words) - 23:12, 19 June 2015
• B-tree: split
  B-TREE-SPLIT-CHILD(''x'', ''i'')
  852 bytes (119 words) - 08:42, 5 October 2014
• Heap as array
  The heap property may be viewed as follows: Imagine a [[Directed Tree|binary tree]] of <math>N</math> nodes such that each height level except for the last o
  3 KB (462 words) - 23:12, 19 June 2015
• Heap as array: descendItem
  ...that fulfill the heap property. Therefore the heap property for the whole tree is restored again. '''Proof:''' Follows immediately from the fact that the height of the heap tree is in <math>\Theta (log n)</math>.
  4 KB (635 words) - 23:12, 19 June 2015
• B-tree: insert and rearrange
  [[Category:B-Tree]] # Three pointers <math>p, p_1, p_2 </math> of type "pointer to B-tree node".
  4 KB (689 words) - 23:19, 19 June 2015
• Binary search
  ...ue <math>r-\ell</math> is roughly halved in every descent in the recursion tree.
  2 KB (298 words) - 06:29, 27 April 2016
• Sorted sequence
  # [[Binary Search Tree]]
  2 KB (270 words) - 13:06, 21 May 2015
• Basic graph definitions
  # A '''forest''' is a [[#Cycles|cycle-free]] undirected graph. A '''tree''' is a connected forest. ...h of <math>G</math> that is a forest/tree/branching/arborescence. A forest/tree/branching/arborescence is '''spanning''' if it contains all nodes of <math>
  15 KB (2,712 words) - 14:47, 16 May 2015
• Algorithms and correctness
  ...on of the recursive routine, this means that every branch of the recursion tree must reach the break condition after a finite number of recursive descents. ...: after a finite number of recursive calls in each branch of the recursive tree.
  12 KB (1,782 words) - 12:49, 28 April 2016
• B-tree: shift key to sibling
  [[Category:B-Tree]]
  4 KB (708 words) - 23:17, 19 June 2015
• Kosaraju
  4 output the vertices of each tree in the '''DFS''' forest of step 3 as a separate strongly connected componen
  4 KB (789 words) - 07:37, 2 November 2015
• Hopcroft-Tarjan
  ...h> or an immediate or non-immediate successor of <math>v</math> in the DFS tree.
  6 KB (1,028 words) - 13:31, 3 November 2015
• Breadth-first search
  [[Category:Tree Algorithms]]
  7 KB (1,165 words) - 07:50, 26 October 2015
• Depth-first search
  [[Category:Tree Algorithms]]
  11 KB (1,966 words) - 06:52, 26 October 2015

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)