Search results

Page title matches

• 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
• 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: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
• 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
• Binary Search Tree:Maximum
  #REDIRECT [[Binary search tree: maximum]]
  41 bytes (5 words) - 08:41, 5 October 2014

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:Split-Child
  #REDIRECT [[B-tree: split]]
  27 bytes (3 words) - 08:42, 5 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
• Binary Search Tree:Traverse
  #REDIRECT [[Binary search tree: traverse]]
  42 bytes (5 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:Remove node
  #REDIRECT [[Binary search tree: remove node]]
  45 bytes (6 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

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