id stringlengths 2 8 | url stringlengths 31 133 | title stringlengths 1 79 | text stringlengths 1 512 | embedding list |
|---|---|---|---|---|
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | by replacing the position of by its right child, and takes the position of in the BST, as shown in fig. 2 part (d).
Following is a pseudocode for the deletion operation in a binary search tree.
The procedure deals with the 3 special cases mentioned above. Lines 2-3 deal with case 1; lines 4-5 deal with case 2 an... | [
-0.0359586,
0.0154998535,
0.0011336505,
-0.08469894,
0.037284505,
-0.043118495,
0.030177644,
-0.001038351,
0.021943761,
-0.0015612555,
0.062370665,
-0.040387128,
0.0152877085,
-0.027737975,
0.008684691,
-0.0030959928,
-0.006317947,
0.08024389,
-0.0039014814,
0.031450514,
0.08... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | (and substitution) of from the BST.
Traversal
A BST can be traversed through three basic algorithms: inorder, preorder, and postorder tree walks.
Inorder tree walk: Nodes from the left subtree get visited first, followed by the root node and right subtree.
Preorder tree walk: The root node gets visited first, foll... | [
-0.021354204,
-0.055507623,
-0.011827967,
-0.054815777,
-0.0049859737,
0.008169147,
0.0057842615,
-0.03980796,
0.07865798,
-0.0055946684,
0.04451786,
-0.04904149,
0.01668422,
-0.007237811,
0.0031549006,
0.014475622,
-0.034965012,
0.028286004,
0.002579468,
0.0029420238,
0.0996... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | on of the tree walks.
Examples of applications
Sort
A binary search tree can be used in sorting algorithm implementation. The process involves inserting all the elements which are to be sorted and performing inorder traversal. This method is similar to that of quicksort where each node corresponds to a partitioning ... | [
-0.082001984,
-0.017272701,
-0.05204485,
-0.07922768,
-0.0044215447,
0.010023502,
0.04628284,
-0.05391217,
0.0567665,
0.00837626,
0.025622286,
-0.006088794,
0.0029410275,
0.003151101,
-0.0014471723,
0.012904509,
-0.02479533,
0.027036114,
0.013051227,
-0.026155805,
0.045109093... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | y as priorities. Adding new elements to the queue follows the regular BST operation; but the removal operation depends on the type of priority queue:
If it's an ascending order priority queue, removal of an element with the lowest priority is done through leftward traversal of the BST i.e. .
On the other hand, if it... | [
-0.033953533,
-0.023608318,
0.0027056723,
-0.043768227,
0.030717338,
0.029391028,
0.07002916,
0.016525822,
0.10085261,
-0.021897377,
0.0017341502,
0.040001508,
0.0031284336,
0.030584708,
0.015080144,
0.02533252,
-0.028515663,
0.0044729803,
-0.04241539,
-0.020491488,
0.0568721... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree |
Self-balancing binary search trees modify the basic insertion and deletion operations of binary search trees, often using additional information on each node, in order to maintain logarithmic depth. These include two early structures of this type, AVL trees, which maintain an invariant that subtree heights differ by a... | [
-0.0813357,
-0.034084544,
-0.09455541,
-0.0461097,
0.044463873,
0.023333577,
-0.01870137,
-0.032810356,
0.050781723,
0.008408317,
0.018356279,
-0.049135897,
-0.0039519756,
0.01844919,
0.041915495,
0.016763544,
-0.062222876,
0.018727917,
-0.0355711,
0.0018698053,
0.053117733,
... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | in the WAVL tree.
The T-tree is a height-balanced binary search tree optimized to reduce storage space overhead which are used for in-memory databases.
Weight-balanced trees achieve (a worst-case logarithmic time bound for searching and) constant time bounds (in an amortized sense: summing over whole sequences of ... | [
-0.045050632,
0.025786962,
-0.03456012,
-0.03836759,
0.023603657,
-0.016547853,
-0.02248538,
-0.02723806,
0.058469974,
0.021047592,
0.061398797,
-0.080942035,
0.022551943,
0.0327762,
0.019982565,
0.01094315,
-0.020688146,
-0.012627224,
0.015229884,
0.014830498,
0.054396246,
... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | ys are inserted in a random order to a non-self-balancing binary tree, or drawn independently from a random distribution, without deletions, the resulting random binary search tree has both logarithmic expected depth, and logarithmic worst-case depth with high probability.
The treap (tree heap) is a self-balancing ve... | [
-0.03735365,
-0.008827355,
-0.0594154,
-0.025659064,
0.0441235,
-0.013214484,
0.004330714,
-0.058672044,
0.05299068,
-0.039318234,
0.04736241,
-0.036743034,
0.038282845,
-0.0120994495,
0.049804866,
0.01090477,
-0.049831413,
0.0041382373,
0.023813946,
-0.006139326,
0.09647702,... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | tree, with higher priorities at each node than at its children.
Certain types of self-balancing binary search trees have been designed to take advantage of non-uniform access patterns by handling frequently requested keys more quickly. The performance of these online binary search trees can be analyzed by their compet... | [
-0.049901012,
-0.033285037,
-0.07973545,
-0.041513395,
0.024910692,
0.007418794,
0.006277441,
-0.05067076,
0.026198031,
-0.002627766,
0.009568784,
-0.011267543,
0.045017082,
-0.0025829745,
0.021141572,
0.029622091,
-0.029648634,
-0.018142203,
0.022442184,
0.06248244,
0.056802... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | uest. Splay trees have been conjectured to have a constant competitive ratio, but this has not been proven. The geometry of binary search trees gives a way of reformulating these problems geometrically, in terms of augmenting point sets to avoid axis-parallel rectangles with only two diagonal vertices present in the au... | [
-0.051489756,
-0.008740056,
-0.028042113,
-0.00823176,
-0.027170748,
-0.008489208,
-0.036914196,
0.006046746,
0.03445853,
0.06057308,
0.014707587,
-0.047951486,
0.030233728,
0.043726686,
0.00034924742,
0.017678149,
-0.008304373,
0.06706871,
0.026840685,
0.07678575,
0.04314577... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | ts of memory per node.
A binary search tree may be "degenerate", by having only left children at every node, or by having only right children at every node. When the resulting degenerate binary search tree contains nodes it has height of . The performance or time complexity of a lookup operation is essentially identi... | [
-0.039929505,
-0.007766289,
-0.027191995,
0.004655115,
-0.006149144,
-0.019578768,
0.037560355,
-0.014667439,
0.057072576,
0.0036069655,
0.078794226,
0.023065945,
0.06511172,
0.042671334,
0.014481101,
0.0002256433,
-0.023412,
0.008737907,
-0.0034173003,
0.0055169268,
0.077410... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | trees, a study shows that treaps perform better on average case, while red–black tree was found to have the smallest number of performance variations.
Optimal binary search trees
Optimal binary search tree is a theoretical computer science problem which deals with constructing an "optimal" binary search trees that en... | [
-0.034166604,
-0.023991596,
-0.09789428,
-0.022933932,
0.012805782,
-0.006797842,
0.0031378518,
-0.0025889368,
0.0801148,
0.007002012,
0.03946832,
-0.031060548,
0.006700778,
0.020791825,
-0.0030792786,
0.020550838,
-0.010181702,
0.0018743435,
0.031542525,
0.046349835,
0.07909... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | in the tree than insertion or deletion.
Threaded binary trees
A threaded binary search tree is an accessorial version of a binary tree whose pointers—either left or right fields of a node—points to the inorder successor or inorder predecessor of the given nodes such that efficient utilization of the placeholders fie... | [
-0.032803647,
-0.03779087,
-0.056806315,
-0.06640738,
0.023602623,
-0.0062206914,
0.02392266,
-0.043631516,
0.067740865,
-0.00506723,
0.034537174,
-0.0635804,
0.016681854,
0.023442606,
0.003793755,
-0.007994222,
-0.030803425,
0.034217138,
0.021509059,
0.03037671,
0.05733971,
... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | sor, but not both.
Two-way threading: The left and right pointer fields hold the references to the inorder predecessor and inorder successor respectively.
See also
Binary search algorithm
Search tree
Join-based tree algorithms
Weight-balanced tree
Notes
References
Further reading
External links
Ben Pfaff:... | [
-0.074170776,
-0.011557795,
-0.07327206,
-0.079245895,
0.0010829237,
0.015872968,
0.0010920101,
-0.055614866,
0.059262607,
-0.011848557,
0.042160507,
-0.033939872,
-0.0018701291,
0.01769684,
0.016084433,
0.006717266,
-0.059368342,
0.03576374,
0.04549106,
0.017749706,
0.038354... |
4320 | https://en.wikipedia.org/wiki/Binary%20search%20tree | Binary search tree | ode
Articles with example Python (programming language) code
Binary trees
Data types
Search trees | [
-0.06529898,
-0.010206263,
-0.04815668,
-0.03359891,
0.05949697,
0.00020006219,
-0.07685025,
-0.017234605,
0.026148602,
0.03502304,
0.01201939,
-0.019832324,
0.014900615,
-0.026913412,
0.061184827,
0.035049412,
-0.008861251,
0.012856726,
-0.034759313,
0.014412719,
0.020860862... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the and the . A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a single... | [
0.010792126,
0.01136717,
-0.027053867,
-0.058841825,
0.02800336,
-0.014991292,
-0.016395472,
-0.026331717,
0.06520744,
0.0050650775,
0.054321703,
-0.07735025,
0.04057411,
0.02566306,
0.009428065,
0.0334596,
-0.048143312,
-0.011146514,
0.041135784,
0.052075014,
0.113404244,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | ary tree may thus be also called a bifurcating arborescence—a term which appears in some very old programming books, before the modern computer science terminology prevailed. It is also possible to interpret a binary tree as an undirected, rather than a directed graph, in which case a binary tree is an ordered, rooted ... | [
-0.040483966,
0.00024212,
-0.029333496,
-0.024012288,
0.041794214,
-0.022314314,
-0.04433449,
-0.022140505,
-0.0025101933,
0.033130538,
0.043772954,
-0.034574486,
0.0009124937,
0.0017280558,
0.018971846,
0.046687588,
-0.031740073,
0.047222383,
0.01867771,
0.0055451537,
0.1420... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | case of an ordered K-ary tree, where K is 2.
In mathematics, what is termed binary tree can vary significantly from author to author. Some use the definition commonly used in computer science, but others define it as every non-leaf having exactly two children and don't necessarily order (as left/right) the children e... | [
0.02016637,
-0.03864102,
-0.06713172,
-0.058055513,
0.0041420273,
-0.011043169,
0.026423046,
-0.036197424,
0.03952716,
0.046106067,
0.03856046,
-0.029027756,
0.003354908,
-0.023187296,
0.0040010507,
0.026248503,
-0.06299641,
-0.012426082,
0.004484399,
0.008163217,
0.11278129,... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | way are used to implement binary search trees and binary heaps, and are used for efficient searching and sorting. The designation of non-root nodes as left or right child even when there is only one child present matters in some of these applications, in particular, it is significant in binary search trees. However, t... | [
-0.021139484,
0.0022561438,
-0.053068496,
-0.07054487,
0.0062472704,
0.022325,
0.032155458,
-0.047820255,
0.019967288,
0.023084262,
0.03191569,
0.030636933,
0.0039828015,
0.00885807,
0.014945495,
-0.00096489687,
-0.05218935,
0.052295912,
0.01280757,
-0.0056844833,
0.12371993,... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | der in which they were added, and can be re-arranged (for example by balancing) without changing the meaning.
Second, as a representation of data with a relevant bifurcating structure. In such cases, the particular arrangement of nodes under and/or to the left or right of other nodes is part of the information (that is... | [
0.012136125,
0.002661431,
0.05972251,
-0.02479123,
0.045749996,
-0.034199387,
0.029435426,
-0.010885253,
-0.03475829,
-0.025004143,
0.00014107663,
0.025602965,
-0.011410885,
0.009082133,
0.029808026,
-0.010319699,
-0.059935424,
0.04077312,
0.020612782,
0.0017781685,
0.0731361... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | gous example with n-ary rather than binary trees.
Definitions
Recursive definition
To actually define a binary tree in general, we must allow for the possibility that only one of the children may be empty. An artifact, which in some textbooks is called an extended binary tree is needed for that purpose. An extended... | [
0.019873187,
0.00010838855,
0.015293248,
-0.015895871,
-0.047111772,
-0.05396829,
-0.024118336,
-0.037389446,
0.03832686,
0.008450122,
0.036050282,
-0.06626181,
-0.021654274,
-0.018467065,
-0.027747469,
0.0072917454,
-0.046736807,
0.03259524,
0.007867586,
-0.015025415,
0.1174... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | adding edges when these sub-trees are non-empty.
Another way of imagining this construction (and understanding the terminology) is to consider instead of the empty set a different type of node—for instance square nodes if the regular ones are circles.
Using graph theory concepts
A binary tree is a rooted tree that ... | [
0.02451095,
-0.027502706,
-0.020633738,
-0.03273493,
0.0045010527,
0.0051684966,
-0.01754807,
-0.0062484806,
0.05084647,
0.025745217,
0.066650465,
-0.05919119,
0.03131284,
0.025691552,
0.038450126,
0.03316424,
-0.027395379,
-0.00014809956,
-0.04373601,
0.019318974,
0.12911515... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | ion of children may be defined as the nodes connected to it a level below. Ordering of these children (e.g., by drawing them on a plane) makes it possible to distinguish a left child from a right child. But this still doesn't distinguish between a node with left but not a right child from a one with right but no left c... | [
-0.020006644,
-0.02586974,
-0.02701832,
-0.022424003,
0.008727865,
0.025255384,
0.04215018,
-0.013969927,
0.051926456,
0.03675453,
0.07954578,
-0.025322162,
-0.03440395,
0.02731214,
0.031412303,
-0.004908172,
-0.023692781,
0.03939893,
-0.06437385,
-0.0076059974,
0.11336208,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | nce) and E1 ∩ E2 is empty, and also requiring that for all j ∈ { 1, 2 } every node has at most one Ej child. A more informal way of making the distinction is to say, quoting the Encyclopedia of Mathematics, that "every node has a left child, a right child, neither, or both" and to specify that these "are all different"... | [
-0.041504312,
0.009744202,
-0.054806978,
-0.05821246,
0.01617604,
0.026671842,
0.018211348,
-0.02256132,
0.024742955,
0.038258463,
-0.0053443452,
-0.02571405,
0.023731953,
-0.007063715,
0.041770365,
0.010189841,
-0.054487713,
0.011054514,
-0.050895993,
0.019435192,
0.14835131... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | binary tree (sometimes referred to as a proper or plane binary tree) is a tree in which every node has either 0 or 2 children. Another way of defining a full binary tree is a recursive definition. A full binary tree is either:
A single vertex.
A tree whose root node has two subtrees, both of which are full binary tre... | [
0.029928315,
-0.017438125,
-0.06477782,
-0.06654303,
0.009849064,
-0.0074219014,
-0.01141368,
-0.043836024,
0.03888809,
0.0482223,
0.05841237,
-0.08719063,
0.03573211,
0.0031141897,
0.0053357454,
0.033565715,
-0.019617891,
0.006860244,
0.017117178,
0.025221093,
0.1370444,
-... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | level h. An alternative definition is a perfect tree whose rightmost leaves (perhaps all) have been removed. Some authors use the term complete to refer instead to a perfect binary tree as defined below, in which case they call this type of tree (with a possibly not filled last level) an almost complete binary tree or ... | [
0.0027956946,
0.015163315,
-0.029208353,
-0.03988524,
0.023816656,
-0.012001517,
-0.006649759,
-0.006549913,
0.021353781,
0.046195526,
0.0531182,
-0.06107927,
-0.01316639,
-0.012860195,
0.006213764,
0.028409582,
-0.011961579,
0.0410834,
0.0075017805,
0.02035532,
0.08190054,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | s have the same depth or same level. An example of a perfect binary tree is the (non-incestuous) ancestry chart of a person to a given depth, as each person has exactly two biological parents (one mother and one father). Provided the ancestry chart always displays the mother and the father on the same side for a given ... | [
0.0019995398,
0.027007986,
-0.058693256,
-0.044100124,
-0.003975693,
-0.001738948,
-0.00738343,
-0.003975693,
0.008546069,
0.008071659,
0.048135955,
-0.07061365,
0.0010348496,
-0.0060938355,
-0.0006786241,
0.0483765,
-0.06227472,
0.06435946,
-0.030201903,
0.08942971,
0.105840... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | not necessarily perfect.
In the infinite complete binary tree, every node has two children (and so the set of levels is countably infinite). The set of all nodes is countably infinite, but the set of all infinite paths from the root is uncountable, having the cardinality of the continuum. That's because these paths c... | [
-0.03624241,
-0.047688793,
-0.036912575,
-0.042461526,
-0.036537282,
-0.029085072,
-0.04964567,
-0.016807687,
0.027409665,
0.033454534,
0.04302446,
-0.042917237,
0.036912575,
0.0037562633,
0.03586712,
0.04243472,
-0.03956642,
0.03302563,
-0.033722598,
0.030452205,
0.08401163,... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | a binary tree structure in which the left and right subtrees of every node differ in height by no more than 1. One may also consider binary trees where no leaf is much farther away from the root than any other leaf. (Different balancing schemes allow different definitions of "much farther".<ref>Paul E. Black (ed.), ent... | [
-0.004121623,
-0.02316339,
-0.045079008,
-0.014774128,
0.048078965,
-0.019393532,
0.004838427,
-0.020097062,
0.082299724,
0.01025428,
0.03913219,
-0.06737958,
0.020495286,
-0.015928978,
-0.002626622,
0.0012344959,
-0.026601395,
0.05394614,
-0.014867047,
0.059680574,
0.1245646... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | enerate (or pathological) tree is where each parent node has only one associated child node. This means that the tree will behave like a linked list data structure.
Properties of binary trees
The number of nodes in a full binary tree is at least and at most , where is the height of the tree. A tree consisting of... | [
-0.022775931,
-0.03722116,
-0.060344204,
-0.038849916,
-0.009565624,
0.0030188789,
0.041787025,
0.0036847345,
0.05997039,
0.04515135,
0.047581136,
-0.03804889,
0.009939438,
0.038849916,
-0.01999903,
0.024097629,
-0.0055738282,
0.044991143,
-0.048008353,
0.030278904,
0.1092603... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | leaves has nodes.
In a balanced full binary tree, (see ceiling function).
In a perfect full binary tree, thus .
The number of null links (i.e., absent children of the nodes) in a binary tree of n nodes is (n+1).
The number of internal nodes in a complete binary tree of n nodes is .
For any non-empty binary tre... | [
-0.010318541,
-0.03380855,
-0.056472015,
-0.061644614,
0.0113184,
0.013218131,
0.0023746642,
-0.006762377,
0.049113054,
0.02467651,
0.031195588,
-0.08633446,
0.036794797,
0.01747753,
0.008272164,
0.020063829,
0.009272022,
0.0122649325,
-0.035781607,
0.024356555,
0.05588543,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | trees have no values attached to their nodes (this would just multiply the number of possible trees by an easily determined factor), and trees are distinguished only by their structure; however, the left and right child of any node are distinguished (if they are different trees, then interchanging them will produce a t... | [
0.0019064287,
-0.039739642,
-0.031657457,
-0.074484974,
0.05278928,
-0.0034604366,
0.03173801,
-0.048815314,
0.042585857,
0.052520767,
0.039122064,
-0.040813684,
0.040410917,
-0.0056185946,
0.00092971965,
0.023159081,
-0.052198555,
-0.021735972,
-0.058965035,
0.018285604,
0.0... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | mber of such binary trees of size n is equal to the number of ways of fully parenthesizing a string of symbols (representing leaves) separated by n binary operators (representing internal nodes), to determine the argument subexpressions of each operator. For instance for one has to parenthesize a string like , which ... | [
-0.045171537,
0.023611788,
-0.054632243,
-0.09290146,
-0.00939408,
-0.024224736,
0.020333854,
-0.06907647,
0.010979748,
0.014404257,
0.011812557,
-0.022319268,
0.034618188,
-0.03381869,
0.04208015,
-0.0042872983,
-0.02974126,
0.024424609,
-0.036856774,
-0.023625113,
0.1006832... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | ssion) is disallowed (or at least not counted as producing a new possibility).
There is a unique binary tree of size 0 (consisting of a single leaf), and any other binary tree is characterized by the pair of its left and right children; if these have sizes i and j respectively, the full tree has size . Therefore, the ... | [
-0.025394375,
-0.018360442,
-0.058143627,
-0.081358284,
-0.0040384945,
-0.0138539085,
0.021048313,
-0.011299762,
0.04190941,
0.041374512,
0.051296905,
-0.043059446,
-0.02403038,
0.018855223,
-0.0140946135,
-0.011734367,
-0.027467113,
-0.027734563,
-0.08119781,
0.01791915,
0.1... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | should not be confused with the set of words of length 2n in the Dyck language, which consist only of parentheses in such a way that they are properly balanced. The number of such strings satisfies the same recursive description (each Dyck word of length 2n is determined by the Dyck subword enclosed by the initial '('... | [
-0.0679644,
-0.006762993,
-0.06250584,
-0.03366111,
-0.0423841,
-0.01212121,
0.010442168,
0.015184959,
0.027480094,
-0.03735366,
0.0023011568,
-0.060739838,
-0.013505918,
0.017124888,
0.054853156,
-0.0068900916,
-0.030851556,
-0.010475615,
-0.026610471,
-0.00074712344,
0.1048... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | e also five Dyck words of length 6:
These Dyck words do not correspond to binary trees in the same way. Instead, they are related by the following recursively defined bijection: the Dyck word equal to the empty string corresponds to the binary tree of size 0 with only one leaf. Any other Dyck word can be written as ... | [
-0.031670377,
0.00007070776,
-0.0292837,
-0.04649994,
-0.024765108,
-0.0067745373,
0.015325673,
-0.03791864,
0.025931628,
-0.030115014,
0.039554447,
-0.05518851,
-0.011772476,
-0.031107226,
0.037248224,
-0.00791089,
0.018838644,
0.0034828028,
-0.060712725,
0.027621072,
0.1317... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | s that are the left and right children of the root.
A bijective correspondence can also be defined as follows: enclose the Dyck word in an extra pair of parentheses, so that the result can be interpreted as a Lisp list expression (with the empty list () as only occurring atom); then the dotted-pair expression for that... | [
-0.037718542,
-0.010271686,
-0.037905663,
-0.075971715,
-0.030394033,
-0.010565735,
0.051298283,
-0.027560465,
0.004935355,
0.0072777267,
-0.0024994214,
-0.010218223,
0.011902325,
-0.035366144,
0.030046519,
-0.027226318,
-0.004958745,
0.075169764,
-0.040578842,
0.009222464,
0... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | list).
The ability to represent binary trees as strings of symbols and parentheses implies that binary trees can represent the elements of a free magma on a singleton set.
Methods for storing binary trees
Binary trees can be constructed from programming language primitives in several ways.
Nodes and references
... | [
-0.026425453,
0.032154985,
-0.0014708696,
-0.030013103,
-0.0043138815,
-0.014939617,
-0.023078764,
-0.038901906,
0.0026204572,
-0.001122814,
-0.026733348,
-0.032342397,
0.045675606,
-0.007971812,
-0.014042705,
0.01595701,
-0.030495027,
0.0043875086,
0.008239548,
0.0084269615,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | . Sometimes it also contains a reference to its unique parent. If a node has fewer than two children, some of the child pointers may be set to a special null value, or to a special sentinel node.
This method of storing binary trees wastes a fair bit of memory, as the pointers will be null (or point to the sentinel) mo... | [
-0.025711985,
0.011811277,
-0.06627624,
-0.029757764,
0.022903897,
0.009256049,
-0.01656906,
-0.033005033,
0.07085436,
-0.0126563655,
0.0034635323,
-0.04881551,
0.07010908,
0.06350807,
0.035719965,
-0.024966711,
-0.022571184,
0.053047605,
0.029385127,
0.017820057,
0.06420011,... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | nodes, one of which is a 3-tuple of data, left child, and right child, and the other of which is a "leaf" node, which contains no data and functions much like the null value in a language with pointers. For example, the following line of code in OCaml (an ML dialect) defines a binary tree that stores a character in eac... | [
-0.02568582,
0.0009287641,
-0.038615283,
-0.03227705,
0.023914844,
0.009414139,
-0.015046644,
-0.02902804,
0.056884304,
0.029960133,
0.011797635,
-0.043329008,
0.03467386,
0.023768373,
-0.023368904,
-0.0152996415,
-0.016418153,
0.013568611,
-0.034833647,
0.022277024,
0.096298... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | s a complete binary tree, this method wastes no space. In this compact arrangement, if a node has an index i, its children are found at indices (for the left child) and (for the right), while its parent (if any) is found at index (assuming the root has index zero). Alternatively, with a 1-indexed array, the implemen... | [
-0.0049466514,
-0.008644958,
-0.014579604,
-0.0373569,
0.02947964,
-0.00297233,
-0.020173794,
-0.024432853,
0.06146932,
-0.008978739,
0.09265792,
-0.021976216,
0.016248515,
-0.017957479,
-0.04029418,
-0.015420735,
-0.052630767,
0.013377989,
-0.015767869,
0.0066255755,
0.13960... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | al. However, it is expensive to grow and wastes space proportional to 2h - n for a tree of depth h with n nodes.
This method of storage is often used for binary heaps.
Encodings
Succinct encodings
A succinct data structure is one which occupies close to minimum possible space, as established by information theor... | [
-0.008789661,
-0.009702614,
-0.06301367,
-0.05003243,
0.041369382,
0.028254863,
-0.03550517,
-0.019845042,
0.07351595,
-0.0047313566,
0.032013293,
-0.05491039,
0.017472701,
0.046967044,
0.053364374,
0.031027038,
-0.04944601,
0.014287365,
0.021750914,
0.022817135,
0.118777044,... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | we need at least about bits to encode it. A succinct binary tree therefore would occupy bits.
One simple representation which meets this bound is to visit the nodes of the tree in preorder, outputting "1" for an internal node and "0" for a leaf. If the tree contains data, we can simply simultaneously store it in a ... | [
-0.06690423,
-0.037557,
-0.02948051,
-0.096917845,
0.038863096,
0.012694478,
-0.03190612,
-0.05906764,
0.03819672,
0.033078946,
-0.008296391,
-0.06653106,
0.013820655,
0.024402719,
0.026735038,
0.014020568,
-0.046113275,
0.010715339,
-0.014433722,
0.024256116,
0.103901476,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | lse
append 1 to structure;
append n.data to data;
EncodeSuccinct(n.left, structure, data);
EncodeSuccinct(n.right, structure, data);
}
The string structure has only bits in the end, where is the number of (internal) nodes; we don't even have to store its length. To show that no i... | [
-0.030389553,
-0.021373898,
-0.0062057544,
-0.065413445,
0.032147408,
-0.045597646,
-0.030389553,
-0.030895602,
0.028258823,
0.013849753,
0.02354458,
-0.02154702,
0.022798823,
0.002348798,
0.017978044,
-0.037234526,
-0.052655693,
0.021200774,
-0.043733258,
0.026421066,
0.1011... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | b if b = 1 then
create a new node n remove first element of data and put it in n.data
n.left = DecodeSuccinct(structure, data)
n.right = DecodeSuccinct(structure, data)
return n
else
return nil
}
More sophisticated succinct representations allow not only ... | [
-0.019350076,
-0.02232396,
-0.028575726,
-0.08342738,
0.07940932,
0.015530285,
-0.03267308,
-0.05551251,
0.033809762,
0.011584932,
0.00787749,
-0.08311016,
0.045625996,
0.021464838,
0.031483524,
0.008287225,
-0.04483296,
0.027439041,
0.007963402,
0.046789117,
0.08353311,
-0... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | between general ordered trees and binary trees, which in particular is used by Lisp to represent general ordered trees as binary trees. To convert a general ordered tree to a binary tree, we only need to represent the general tree in left-child right-sibling way. The result of this representation will automatically be ... | [
0.025940126,
0.004761713,
-0.038629103,
-0.08903701,
0.05198733,
-0.0020562704,
0.005849244,
-0.05669885,
0.031106735,
0.031079965,
0.0037779156,
-0.038388174,
-0.0036808744,
0.032793246,
-0.0026334983,
-0.031133505,
-0.032445237,
0.07865025,
-0.044063415,
0.022928502,
0.0469... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | child of N, and the right child of N' is the node corresponding to N 's next sibling --- that is, the next node in order among the children of the parent of N. This binary tree representation of a general order tree is sometimes also referred to as a left-child right-sibling binary tree (also known as LCRS tree, doub... | [
-0.026934085,
-0.023646854,
-0.049812153,
-0.06590368,
0.011425778,
0.0021771276,
0.037962213,
-0.066274814,
0.05087255,
0.028736759,
0.05357656,
-0.03976489,
0.011558328,
0.025741138,
-0.00081683707,
-0.012181311,
-0.02502537,
0.06606273,
-0.014461164,
0.019935464,
0.0638359... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | r to the beginning or head of this list, through its left field.
For example, in the tree on the left, A has the 6 children {B,C,D,E,F,G}. It can be converted into the binary tree on the right.
The binary tree can be thought of as the original tree tilted sideways, with the black left edges representing first child ... | [
-0.043874938,
-0.007701452,
-0.031232554,
-0.051583055,
0.019336978,
0.030032327,
0.013749259,
-0.00679128,
0.085189395,
0.05649065,
0.036593564,
0.0032589477,
-0.027525188,
-0.025178079,
0.013502546,
-0.033499647,
-0.025378117,
0.050142784,
-0.06849291,
0.008681636,
0.078894... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | the binary tree on the right, without any letters on those nodes that have a left child.
Common operations
There are a variety of different operations that can be performed on binary trees. Some are mutator operations, while others simply return useful information about the tree.
Insertion
Nodes can be inserted... | [
0.023942498,
-0.038318686,
-0.04737729,
-0.04537317,
0.010174226,
-0.04045641,
0.05018305,
-0.039761648,
0.025959974,
0.05734442,
0.06097855,
-0.04791172,
-0.02014804,
-0.029794516,
0.044357754,
0.0018471263,
-0.06733827,
0.019226147,
-0.02241937,
-0.023354625,
0.07348423,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | ter leaf node A, A assigns the new node as one of its children and the new node assigns node A as its parent.
Internal nodes
Insertion on internal nodes is slightly more complex than on leaf nodes. Say that the internal node is node A and that node B is the child of A. (If the insertion is to insert a right child, ... | [
-0.039542314,
-0.033085335,
-0.055871528,
-0.041596804,
0.025761204,
0.020091336,
0.071827196,
-0.023466574,
0.013534304,
0.034739602,
0.0107994275,
-0.04231721,
-0.0191975,
-0.009685465,
0.013454258,
-0.0040856386,
-0.05763252,
0.016035715,
-0.035753507,
0.010832779,
0.06947... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | B and B assigns its parent as the new node.
Deletion
Deletion is the process whereby a node is removed from the tree. Only certain nodes in a binary tree can be removed unambiguously.
Node with zero or one children
Suppose that the node to delete is node A. If A has no children, deletion is accomplished by set... | [
-0.023999989,
-0.003622577,
-0.032619797,
-0.07655558,
-0.014649688,
-0.004944104,
0.059714414,
-0.028635293,
0.06842719,
0.030547854,
0.057961233,
-0.04255449,
0.000043917727,
-0.002623131,
-0.026669605,
0.006511342,
-0.026032085,
0.04534364,
-0.05270169,
0.009609292,
0.1435... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | node with two children cannot be deleted unambiguously. However, in certain binary trees (including binary search trees) these nodes can be deleted, though with a rearrangement of the tree structure.
Traversal
Pre-order, in-order, and post-order traversal visit each node in a tree by recursively visiting each node ... | [
-0.02614272,
-0.020985946,
-0.0405365,
-0.0578941,
0.0051202253,
0.030568508,
-0.0017527053,
-0.05629922,
0.06517738,
-0.011084408,
0.05382716,
-0.01743734,
0.043460447,
0.0012194177,
0.0009826779,
-0.008778478,
-0.048324827,
0.047686875,
-0.073683396,
-0.0066685867,
0.121636... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | must be a child of a node we have already visited. Unlike a depth-first search on graphs, there is no need to remember all the nodes we have visited, because a tree cannot contain cycles. Pre-order is a special case of this. See depth-first search for more information.
Breadth-first order
Contrasting with depth-firs... | [
-0.030111508,
-0.039704554,
-0.014016507,
-0.017573928,
-0.011211874,
0.06379376,
-0.011971323,
-0.037572768,
0.07701085,
-0.005639246,
0.039411433,
0.0025148438,
0.047778703,
0.052388694,
-0.02043852,
-0.017134247,
-0.049191013,
0.013057203,
-0.034774795,
-0.029365383,
0.066... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | order traversal.
In a complete binary tree, a node's breadth-index (i − (2d − 1)) can be used as traversal instructions from the root. Reading bitwise from left to right, starting at bit d − 1, where d is the node's distance from the root (d = ⌊log(i+1)⌋) and the node in question is not the root itself (d > 0). When t... | [
-0.038009636,
-0.00701226,
-0.029802104,
-0.06273848,
-0.008997739,
0.020611795,
0.030094283,
-0.023281235,
0.060879167,
0.0013820328,
0.066350855,
-0.053415358,
0.013480008,
-0.002621297,
-0.030094283,
-0.0010143208,
-0.053388797,
0.012158568,
-0.009475848,
0.0013048381,
0.1... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | ere are no more. The rightmost bit indicates the final traversal from the desired node's parent to the node itself. There is a time-space trade-off between iterating a complete binary tree this way versus each node having pointer/s to its sibling/s.
See also
References
Citations
Bibliography
Donald Knuth. ... | [
-0.04918903,
-0.012130719,
-0.02592683,
-0.09987026,
0.042660695,
-0.012703613,
0.03738473,
-0.0372515,
0.065336674,
0.06709533,
0.044339407,
-0.054038655,
0.007647482,
0.013096646,
-0.0058655124,
0.013383094,
-0.05995413,
0.058195475,
0.023062354,
0.024034943,
0.114898756,
... |
4321 | https://en.wikipedia.org/wiki/Binary%20tree | Binary tree | trees entry in the FindStat database
Binary Tree Proof by Induction
Balanced binary search tree on array How to create bottom-up an Ahnentafel list, or a balanced binary search tree on array
Binary trees and Implementation of the same with working code examples
Binary Tree JavaScript Implementation with source cod... | [
-0.097705595,
-0.0005419151,
-0.062200412,
-0.046756454,
0.023192475,
0.015788928,
-0.03757499,
-0.041635003,
0.042563763,
0.012637775,
-0.0016908415,
-0.048030183,
-0.0018260094,
-0.018787496,
0.0022074645,
0.040308204,
-0.056203272,
0.01796488,
-0.029375365,
0.020512337,
0.... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | In mathematics, specifically in measure theory, a Borel measure on a topological space is a measure that is defined on all open sets (and thus on all Borel sets). Some authors require additional restrictions on the measure, as described below.
Formal definition
Let be a locally compact Hausdorff space, and let be t... | [
-0.03284177,
-0.012100309,
0.094379716,
0.0024479907,
-0.03491457,
-0.04029847,
0.04875119,
0.0088632405,
0.060030453,
-0.08447335,
0.026852187,
-0.07359788,
-0.014523063,
0.041267574,
-0.046866827,
-0.04614,
-0.07020602,
0.08856511,
-0.053677455,
-0.03408007,
0.12221447,
-... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | ire in addition that is locally finite, meaning that for every compact set . If a Borel measure is both inner regular and outer regular, it is called a regular Borel measure. If is both inner regular, outer regular, and locally finite, it is called a Radon measure.
On the real line
The real line with its usual t... | [
-0.040018428,
-0.030254574,
0.058476128,
0.035872135,
-0.036407143,
-0.05120005,
0.018658325,
0.017802317,
0.044191476,
-0.118557274,
0.015943171,
-0.06275617,
-0.019166581,
0.04108844,
0.028649557,
-0.055587098,
-0.035791885,
0.086296424,
-0.0650567,
0.013870024,
0.123265326... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | el measures μ, the choice of Borel measure that assigns for every half-open interval is sometimes called "the" Borel measure on . This measure turns out to be the restriction to the Borel σ-algebra of the Lebesgue measure , which is a complete measure and is defined on the Lebesgue σ-algebra. The Lebesgue σ-algebra i... | [
-0.042281102,
0.0206458,
0.0599584,
0.0078491485,
-0.062151346,
-0.033134904,
0.04824485,
0.002121075,
0.050972663,
-0.03613015,
0.01851971,
-0.03211866,
-0.07156497,
0.021835875,
0.030300118,
-0.031423334,
-0.034873217,
0.07498811,
-0.09119453,
-0.040088154,
0.13671157,
-0... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | he Lebesgue measure coincide on the Borel sets (i.e., for every Borel measurable set, where is the Borel measure described above).
Product spaces
If X and Y are second-countable, Hausdorff topological spaces, then the set of Borel subsets of their product coincides with the product of the sets of Borel subsets of... | [
-0.066501774,
-0.005944835,
0.046701286,
-0.015232175,
-0.04919309,
-0.04801417,
0.021689437,
0.0579814,
0.067091234,
-0.058034986,
-0.013450399,
-0.09040169,
0.020242583,
0.039520595,
0.00874142,
-0.042119574,
-0.037564658,
0.10642427,
-0.0810775,
-0.04228034,
0.07770151,
... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | s integral
The Lebesgue–Stieltjes integral is the ordinary Lebesgue integral with respect to a measure known as the Lebesgue–Stieltjes measure, which may be associated to any function of bounded variation on the real line. The Lebesgue–Stieltjes measure is a regular Borel measure, and conversely every regular Borel m... | [
-0.048564143,
-0.00798416,
0.028761812,
-0.0438019,
0.008764416,
-0.113325305,
0.07996268,
0.052842095,
0.07840217,
0.021631896,
0.023891944,
-0.013049091,
0.02281573,
0.00765457,
0.02447041,
-0.04320998,
-0.0070828316,
0.05025918,
-0.1082671,
0.0029562246,
0.1253789,
0.015... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | case is where μ is a probability measure or, even more specifically, the Dirac delta function. In operational calculus, the Laplace transform of a measure is often treated as though the measure came from a distribution function f. In that case, to avoid potential confusion, one often writes
where the lower limit ... | [
-0.06198776,
-0.051301137,
0.01734911,
-0.032672826,
-0.047730044,
-0.04938234,
0.06449286,
0.03509797,
0.04442545,
0.04629095,
0.01243886,
-0.048636142,
-0.0064093107,
-0.0069689597,
-0.05942937,
-0.0022202733,
0.017509012,
0.06726445,
-0.009880465,
-0.00404746,
0.120031334,... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | ary to take such a limit, it does appear more naturally in connection with the Laplace–Stieltjes transform.
Hausdorff dimension and Frostman's lemma
Given a Borel measure μ on a metric space X such that μ(X) > 0 and μ(B(x, r)) ≤ rs holds for some constant s > 0 and for every ball B(x, r) in X, then the Hausdorff dime... | [
-0.0654623,
-0.04782355,
0.02119302,
-0.013965113,
-0.0021169812,
-0.061748873,
-0.0031331985,
0.04562202,
0.040980246,
-0.019495457,
-0.010404208,
-0.037054628,
0.03572841,
0.012194607,
0.031378403,
0.0005097664,
-0.042836957,
0.08784892,
-0.05734582,
0.005812166,
0.11426724... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | he s-dimensional Hausdorff measure.
There is an (unsigned) Borel measure μ satisfying μ(A) > 0, and such that
holds for all x ∈ Rn and r > 0.
Cramér–Wold theorem
The Cramér–Wold theorem in measure theory states that a Borel probability measure on is uniquely determined by the totality of its one-dimensional proje... | [
-0.084229976,
-0.03313966,
0.01951735,
-0.03778665,
-0.022876458,
-0.03515778,
0.0434427,
-0.013104506,
0.045991905,
-0.031201204,
0.030563904,
-0.08985947,
0.026647156,
0.05032024,
-0.029687615,
0.01753906,
-0.06914718,
0.04567325,
0.0062701143,
0.023766024,
0.114608,
-0.0... |
4322 | https://en.wikipedia.org/wiki/Borel%20measure | Borel measure | nite-dimensional Borel measure
.
Wiener's lemma related
External links
Borel measure at Encyclopedia of Mathematics
Measures (measure theory) | [
-0.10367145,
-0.08159571,
0.03704815,
-0.04362334,
-0.009044185,
-0.043015994,
0.05136041,
0.03960957,
0.084975734,
-0.05400105,
0.019963223,
-0.045207724,
-0.030446555,
0.0562984,
0.00811336,
0.014523509,
-0.0409827,
0.09279202,
-0.060364984,
0.0075918343,
0.10921679,
-0.0... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | Blackadder is a series of four period British sitcoms, plus several one-off instalments, which originally aired on BBC One from 1983 to 1989. All television episodes starred Rowan Atkinson as the antihero Edmund Blackadder and Tony Robinson as Blackadder's dogsbody, Baldrick. Each series was set in a different historic... | [
-0.040445317,
0.038994122,
0.018395228,
0.015237537,
0.052565474,
-0.060305174,
-0.019523935,
-0.0343718,
-0.051705506,
-0.035285514,
0.028244536,
-0.080406904,
0.048991237,
0.017199337,
-0.03281311,
-0.041251536,
-0.037542928,
0.0052303453,
0.009916493,
0.016393118,
0.021861... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | first series, The Black Adder, was written by Richard Curtis and Rowan Atkinson, while subsequent series were written by Curtis and Ben Elton. The shows were produced by John Lloyd. In 2000, the fourth series, Blackadder Goes Forth, ranked at 16 in the 100 Greatest British Television Programmes, a list created by the B... | [
-0.027398111,
0.047535047,
0.01423892,
-0.029692534,
0.0016364636,
-0.008759297,
-0.055821966,
-0.050828222,
0.015764037,
0.009636577,
0.027964968,
-0.0672131,
-0.01050036,
0.024266899,
-0.037466582,
-0.014913751,
-0.035010196,
-0.036926717,
-0.023106191,
-0.018949237,
0.0410... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | adder was voted the second-best British sitcom of all time, topped by Only Fools and Horses. It was also ranked as the 9th-best TV show of all time by Empire magazine.
Premise
Each series is set in a different period of British history, beginning in 1485 and ending in 1917, and comprises six half-hour episodes. Black... | [
-0.026579717,
0.028725406,
0.034277376,
-0.008193849,
0.0028950034,
-0.040821727,
-0.003718076,
-0.038407825,
0.00538769,
-0.011472729,
0.027303888,
-0.06125941,
-0.024903398,
0.050477326,
-0.03797869,
-0.017366668,
-0.07150508,
-0.0065644663,
-0.019029576,
-0.02156417,
0.041... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | racter is a descendant of the previous one (the end theme lyrics of series 2 episode "Head" specify that he is the great-grandson of the previous), although it is never specified how or when any of the Blackadders (who are usually bachelors) managed to father children.
In series one, Edmund Blackadder is not particula... | [
-0.041340377,
0.05585664,
-0.02654133,
-0.020037292,
0.04586493,
-0.06054278,
0.0038041228,
-0.010099441,
-0.02740315,
-0.069807336,
0.01253004,
-0.07136938,
0.050389476,
0.032829914,
0.001541848,
-0.04645743,
-0.033395484,
0.05507562,
-0.069376424,
0.002383468,
0.014920241,
... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | heming and manipulative while Baldrick is extremely dim. Each incarnation of Blackadder and Baldrick is also saddled with tolerating the presence of a dimwitted aristocrat. In the first two series this is Lord Percy Percy, played by Tim McInnerny. Hugh Laurie plays the role in the third and fourth series, as Prince Geo... | [
-0.068836465,
0.0479511,
0.014625085,
-0.0025274225,
0.028637461,
-0.024348501,
0.013359709,
-0.010076391,
-0.05194702,
0.019699909,
0.05679541,
-0.04789782,
0.021098483,
0.011914516,
-0.02815795,
0.02444174,
-0.03175428,
0.0350043,
-0.10320142,
-0.028504264,
0.0606315,
-0.... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | adder II (1986), was set during the reign of Elizabeth I. Blackadder the Third (1987) was set during the late 18th and early 19th centuries in the reign of George III, and Blackadder Goes Forth (1989) was set in 1917 in the trenches of the Great War.
Episodes
Series 1: The Black Adder
The Black Adder, the first seri... | [
-0.053903498,
0.046291072,
0.015961977,
0.0016677317,
-0.004318847,
-0.024861012,
-0.06861907,
-0.049802437,
-0.030342497,
0.003209818,
0.034175515,
-0.044521984,
-0.008617591,
0.011800605,
-0.007404695,
0.009582547,
-0.057790127,
-0.05559217,
-0.03570336,
-0.030020844,
0.067... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | e Australian Seven Network.
Set in 1485 at the end of the British Middle Ages, the series is written as an alternative history in which Richard III won the Battle of Bosworth Field only to be mistaken for someone else and murdered, and is succeeded by Richard IV (Brian Blessed), one of the Princes in the Tower. The se... | [
-0.07010972,
0.035323683,
-0.02686912,
0.029893408,
0.014140227,
0.022191554,
-0.05806633,
-0.01059845,
-0.053603824,
0.0127490545,
0.0025588837,
-0.099680535,
-0.024261512,
0.052797347,
-0.009758369,
0.023078678,
-0.08511019,
-0.012305493,
-0.03161389,
-0.0076144855,
-0.0015... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | ther and his eventual quest to overthrow him.
Conceived while Atkinson and Curtis were working on Not the Nine O'Clock News, the series dealt comically with a number of aspects of medieval life in Britain: witchcraft, royal succession, European relations, the Crusades, and the conflict between the Church and the Crown... | [
0.0011573773,
0.05168326,
-0.0040630433,
-0.00805865,
0.03312476,
-0.029294373,
-0.011679986,
-0.035768267,
-0.039760504,
0.01726372,
-0.06571003,
-0.05138654,
-0.02291489,
-0.026785739,
-0.001049479,
-0.032153677,
-0.093170136,
0.0042653526,
0.022941865,
-0.017776236,
-0.046... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | events in the episode by 33 years); this dramatic license would continue in the subsequent Blackadders. The filming of the series was highly ambitious, with a large cast and much location shooting. The series also featured Shakespearean dialogue, often adapted for comic effect; the end credits featured the words "Addit... | [
0.016964575,
0.03363481,
0.017111745,
-0.022797821,
0.029192984,
0.008816763,
-0.010964093,
-0.031039286,
-0.023440013,
0.00044903278,
-0.02507225,
-0.06437976,
-0.012054482,
0.06432624,
-0.042063583,
-0.015706949,
0.010362037,
0.011914002,
-0.023720972,
0.001287729,
-0.02654... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | principal character is Edmund, Lord Blackadder, the great-grandson of the original Black Adder. During the series, he regularly deals with the Queen, her obsequious Lord Chamberlain Lord Melchett (Stephen Fry) – his rival – and the Queen's demented former nanny Nursie (Patsy Byrne).
Following the BBC's request for im... | [
-0.06817513,
0.03185452,
0.0407867,
-0.03839223,
0.043934487,
-0.010580059,
0.040517658,
-0.068282746,
-0.005202591,
-0.046248242,
0.008293206,
-0.1009982,
-0.015631314,
0.019115403,
-0.012026157,
-0.05639111,
-0.005364016,
0.015133588,
-0.032473315,
0.007627328,
0.013021612,... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | ast to the first series' bumbling Prince Edmund. To reduce the cost of production, it was shot with virtually no outdoor scenes (the first series was shot largely on location) and several frequently used indoor sets, such as the Queen's throne room and Blackadder's front room.
A quote from this series ranked number th... | [
-0.00796301,
0.056596156,
0.021631062,
-0.005948876,
0.020241544,
0.048927084,
0.004579399,
-0.025532402,
0.008858181,
0.009786753,
0.011109468,
-0.013801659,
-0.006620254,
0.03270713,
-0.030783178,
-0.0021677825,
0.0022178853,
-0.048392653,
-0.042032935,
0.032520078,
0.04288... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | ?"
Series 3: Blackadder the Third
Blackadder the Third is set in the late 18th and early 19th centuries, a period known as the Regency. In the series, Edmund Blackadder Esquire is the butler to the Prince Regent, the Prince of Wales (the prince is played by Hugh Laurie as a complete fop and idiot). Despite Edmund's r... | [
-0.030178834,
0.057172425,
0.04389158,
0.011654482,
0.06775391,
-0.067699924,
0.058738053,
-0.054769993,
-0.035685524,
0.0010105725,
-0.004615904,
-0.09469351,
0.033661008,
0.025292994,
0.011769205,
0.022593634,
-0.023066023,
0.0036036442,
-0.041003264,
-0.0055944216,
0.03444... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | cks) from the Prince: "If I'm running short of cash, all I have to do is go upstairs and ask Prince Fathead for a rise." The episode titles were puns on Jane Austen novels.
As well as Rowan Atkinson and Tony Robinson in their usual roles, this series starred Hugh Laurie as the Prince Regent, and Helen Atkinson-Wood as... | [
-0.056337677,
0.07966457,
0.024370192,
-0.041544355,
-0.008814465,
-0.028944617,
0.036167398,
-0.016920028,
0.0008702445,
0.025721118,
0.0049857236,
-0.04606528,
0.024784831,
0.010439591,
0.02407593,
0.0033856777,
0.036408156,
0.064844504,
-0.11695552,
0.075170405,
-0.0010951... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | nel, and Nigel Planer); hammy theatrical actors (Kenneth Connor and Hugh Paddick); a squirrel-hating cross-dressing highwayman (Miranda Richardson); and a duel with the Duke of Wellington (Stephen Fry).
Series 4: Blackadder Goes Forth
This series is set in 1917, on the Western Front in the trenches of the First World... | [
-0.091668785,
0.113038436,
-0.05014062,
-0.016740454,
0.0099783335,
0.021315819,
0.011438413,
-0.013382943,
-0.065616116,
-0.034234498,
-0.011384585,
-0.059695058,
0.028905543,
0.042523984,
-0.045915134,
-0.030897172,
0.0020925568,
0.07347498,
-0.036979716,
0.031058656,
-0.02... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | e S. Baldrick (Tony Robinson) and idealistic Edwardian twit Lieutenant George (Hugh Laurie). General Melchett (Stephen Fry) rallies his troops from a French château from the front, where he is aided and abetted by his assistant, Captain Kevin Darling (Tim McInnerny), pencil-pusher supreme and Blackadder's nemesis, who... | [
-0.047827158,
0.040852364,
0.03584344,
-0.04661532,
0.052728362,
-0.03212714,
0.02427713,
0.016965713,
-0.03651668,
0.0022957574,
0.018487243,
-0.036247384,
0.0049214037,
-0.009647567,
-0.027899174,
-0.02228433,
0.013289809,
0.058652896,
-0.038832635,
0.03476625,
0.029595746,... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | ife-wasting strategies of the top brass. For example, Baldrick is reduced to making coffee from mud and cooking rats, while General Melchett hatches a plan for the troops to walk very slowly toward the German lines, because "it'll be the last thing Fritz will expect."
The final episode, "Goodbyeee", is known for being... | [
-0.07089389,
0.055347454,
0.014144053,
-0.031359997,
0.07575549,
-0.014851923,
0.019620031,
0.027339827,
-0.020274477,
-0.046185207,
-0.0030051104,
-0.044849604,
0.017376216,
0.033309978,
-0.073458254,
-0.0024308003,
-0.000626482,
0.068650074,
-0.071588404,
0.0091422135,
0.07... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | to the fog and smoke of no man's land presumably to die. In a list of the 100 Greatest British Television Programmes, drawn up by the British Film Institute in 2000 and voted for by industry professionals, Blackadder Goes Forth was placed 16th.
Specials
Pilot episode
The Blackadder pilot was shot but never broadcast... | [
0.023340303,
0.07808883,
-0.011541982,
-0.024014877,
0.07053359,
-0.025876705,
-0.0020962425,
0.003922655,
-0.047813892,
0.02285461,
0.0039631296,
-0.0058114654,
-0.02655128,
0.06087367,
-0.014125605,
0.023083964,
-0.029303547,
-0.057905536,
-0.025836231,
0.00035351957,
0.088... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | aldrick is played not by Tony Robinson, but by Philip Fox. Another significant difference is that the character of Prince Edmund presented in the pilot is much closer to the intelligent, conniving Blackadder of the later series than the snivelling, weak buffoon of the original. Set in the year 1582, the script of the p... | [
-0.046122976,
0.09900885,
0.006952261,
0.0036249142,
0.042525113,
-0.029323934,
-0.015297679,
-0.0059040114,
-0.045257326,
-0.0031430577,
0.011375197,
-0.0049572056,
-0.026618773,
0.012538416,
-0.070604675,
-0.04366128,
-0.06606001,
0.024359966,
-0.005461042,
0.011294043,
-0.... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | ecial, set in the English Civil War, was shown as part of Comic Relief's Red Nose Day on Friday 5 February 1988. The 15-minute episode is set in November 1648, during the last days of the Civil War. Sir Edmund Blackadder and his servant, Baldrick, are the last two men loyal to the defeated King Charles I of England (pl... | [
-0.087412305,
0.08212914,
0.036154967,
-0.013548106,
-0.009919268,
-0.002728299,
0.044373218,
-0.026415806,
-0.0464011,
-0.0031969128,
0.007451125,
-0.05587343,
0.012640897,
-0.009098778,
-0.0041825026,
-0.013494741,
-0.044853505,
0.047868643,
-0.08901326,
0.042558797,
0.0166... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | anding between Oliver Cromwell (guest-star Warren Clarke) and Baldrick, the king is arrested and sent to the Tower of London. The rest of the episode revolves around Blackadder's attempts to save the king, as well as improve his standing.
Blackadder's Christmas Carol
The second special was broadcast on Friday 23 Dece... | [
0.031844817,
0.06358286,
0.03747705,
-0.04070691,
0.06320916,
-0.058991656,
0.034220498,
-0.0061260564,
-0.03886509,
-0.0043910076,
0.01937916,
-0.028881887,
-0.00901558,
0.034887824,
-0.002766068,
0.0699892,
-0.023743473,
0.02952252,
-0.05824425,
0.04751364,
0.012298826,
-... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | his ancestors and descendants, and reluctantly informs him that if he turns evil his descendants will enjoy power and fortune, while if he remains the same a future Blackadder will live shamefully subjugated to a future incompetent Baldrick. This remarkable encounter causes him to proclaim, "Bad guys have all the fun",... | [
-0.021326654,
0.045446724,
-0.015404075,
0.013476887,
-0.017243968,
-0.042116113,
0.02277708,
-0.027034353,
-0.058822885,
-0.06269069,
0.009340484,
-0.013080706,
0.031694524,
0.021125205,
-0.039215256,
0.021286365,
-0.012429357,
0.001034101,
-0.021957858,
-0.05371953,
0.08691... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | g on Sky One in the same year (and later on BBC1). It is set on the turn of the millennium, and features Lord Blackadder placing a bet with his friends – modern versions of Queenie (Miranda Richardson), Melchett (Stephen Fry), George (Hugh Laurie) and Darling (Tim McInnerny) – that he has built a working time machine. ... | [
-0.026419163,
0.03563391,
0.039921697,
-0.04266482,
0.047192294,
0.032224987,
-0.009574283,
-0.0018259716,
-0.00029066572,
-0.012463879,
-0.004820432,
-0.0013191272,
-0.0008921794,
0.018735766,
-0.032571204,
0.008056247,
-0.012483853,
-0.027324658,
-0.083465375,
0.010792707,
... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | nosaurs through the use of Baldrick's best-worst-and-only pair of underpants as a weapon against a hungry T. Rex. Finding that Baldrick has forgotten to write dates on the machine's dials, the rest of the film follows their attempts to find their way back to 1999, often creating huge historical anomalies in the process... | [
-0.022824807,
0.042844925,
-0.025308957,
-0.042791504,
0.055559505,
-0.0005383997,
-0.0043472643,
0.0036794818,
-0.03739582,
-0.05403696,
0.04412707,
-0.0037863269,
-0.006985005,
-0.007539265,
-0.008961641,
-0.018323952,
0.04006695,
0.029435854,
-0.03266792,
0.037449244,
0.04... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | ecial The Big Night In during the 2020 COVID-19 pandemic, Fry resumed the role of Lord Melchett (an intellectually-brilliant version), Head of the Royal Household, under lockdown at Melchett Manor, to help Prince William deal with educating his children via Zoom and discussing Tiger King, before they both step outside ... | [
-0.02922384,
0.046978395,
0.03634178,
-0.044399824,
0.05130288,
0.008984719,
0.01843949,
-0.037389323,
-0.025181388,
-0.06940662,
0.010676908,
-0.02377123,
0.0044352817,
-0.0001748008,
0.006889628,
0.00097284093,
-0.022334212,
-0.03287682,
-0.018990124,
0.051786363,
0.0076551... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | of Prince Charles' 50th Birthday Gala televised on ITV, Atkinson returned to the Cavalier incarnation of Blackadder reading aloud a letter to the Privy Council of King Charles I. He colourfully refuses their invitation to stage a royal gala, calling such occasions "very, very, very dull" and asserting that there was "m... | [
-0.06459806,
0.026017167,
0.061740216,
-0.02756741,
0.01728187,
0.00073004776,
0.00022937737,
-0.024251234,
-0.03229903,
0.0007873394,
0.072308846,
0.04111521,
0.027931383,
0.0025393697,
-0.047801487,
0.048071094,
0.024008587,
-0.0035790454,
-0.06071571,
0.018225497,
0.011060... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | esty's Royal Regiment of Shirkers" and delivered a monologue titled "Blackadder: The Army Years," proposing that Britain regain her former greatness by invading (or at least buying) France.
In 2012, as part of the Prince's Trust charity show We Are Most Amused, Atkinson and Robinson reprised their roles as Blackadder ... | [
-0.049857236,
-0.0010062158,
0.0045321705,
-0.07014953,
0.060527492,
-0.061817598,
-0.00012189238,
-0.019459104,
-0.03370403,
-0.025788689,
0.011678151,
-0.037896875,
0.024700161,
0.004747188,
0.026353111,
-0.023544442,
-0.0033058976,
0.017806156,
0.0051738643,
0.07423487,
-0... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | Baldrick as his gardener, convinces the panel to publicly blame the entire crisis on Baldrick, to the latter's consternation.
Chronological order
Production
Series development
Rowan Atkinson and Richard Curtis developed the idea for the sitcom while working on Not the Nine O'Clock News. Eager to avoid comparisons t... | [
-0.022281477,
-0.004527607,
-0.021649092,
-0.027071457,
0.020047948,
0.039880615,
-0.044455316,
-0.012869705,
-0.039207865,
0.044428404,
0.022375662,
-0.023263693,
0.02697727,
0.040042076,
-0.033718225,
0.005156628,
-0.06011693,
-0.010851456,
-0.00028423683,
0.023371331,
0.08... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | e series was considerable, with much location shooting particularly at Alnwick Castle in Northumberland and the surrounding countryside in February 1983. The series also used large casts of extras, horses and expensive medieval-style costumes. Atkinson has said about the making of the first series:
The first series wa... | [
-0.034192886,
0.019321138,
0.042282686,
-0.024148053,
0.05910947,
0.0377524,
-0.074480094,
-0.03524456,
0.010469549,
0.05501064,
-0.018795302,
-0.013523449,
-0.00048749472,
-0.0033606377,
-0.046947803,
-0.016220048,
-0.0054235365,
-0.10910443,
0.0037718692,
0.07771601,
0.0227... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | e liked.
Due to the high cost of the first series, the then-controller of programming of BBC1, Michael Grade, was reluctant to sign off a second series without major improvements to the show and drastic cost-cutting, leaving a gap of three years between the two series.<ref name="Lewisohn">Lewisohn, Mark, [https://web.... | [
-0.04760976,
0.016683534,
-0.05415443,
0.0011156442,
0.02592385,
0.000005998369,
-0.07177675,
-0.015610637,
0.024166983,
0.019419419,
0.0068330066,
-0.026165253,
-0.018601336,
0.004546397,
0.022758808,
-0.02781483,
-0.04642958,
-0.09221542,
-0.0018423637,
-0.0024693373,
0.005... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | on did not wish to continue writing for the second series.
A chance meeting between Richard Curtis and comedian Ben Elton led to the decision to collaborate on a new series of Blackadder. Recognising the main faults of the first series, Curtis and Elton agreed that Blackadder II would be a studio-only production (alon... | [
-0.038058728,
0.045388155,
-0.031217929,
-0.00022522718,
-0.013287979,
0.003925994,
-0.032819543,
-0.027702518,
-0.028041843,
-0.046691164,
0.043542225,
-0.038411625,
0.036185652,
0.06808223,
-0.020508822,
-0.037407223,
-0.03700003,
-0.019531565,
0.023956368,
0.025870161,
-0.... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | character emphasis: Baldrick would become the stupid sidekick, while Edmund Blackadder evolved into a cunning sycophant. This led to the familiar set-up that was maintained in the following series.
Only in the Back & Forth millennium special was the shooting once again on location, because this was a production with ... | [
-0.046717566,
0.016204568,
0.010401853,
0.027164504,
0.04870784,
-0.010980108,
-0.024569083,
0.011363369,
-0.02518768,
-0.04198395,
0.034775943,
-0.021126453,
0.004468023,
0.020386826,
-0.043301832,
-0.016285254,
-0.017119016,
-0.06960568,
-0.003755291,
0.018799989,
0.0364703... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | e – Interview with Tony Robinson' in Skyview, January 2000
Casting
Each series tended to feature the same set of regular actors in different period settings, although throughout the four series and specials, only Blackadder and Baldrick were constant characters. Several regular cast members recurred as characters wi... | [
-0.0047314814,
0.01578963,
-0.022021666,
-0.019385556,
-0.00084490736,
-0.03666222,
0.005082963,
-0.04131259,
-0.040177036,
-0.02398185,
0.0362837,
-0.004221157,
0.022129815,
0.037824813,
-0.030227406,
-0.0365,
-0.013207592,
-0.0025617592,
-0.026834259,
0.0047483793,
0.003687... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | in cast
Rowan Atkinson as Edmund Blackadder, the series' protagonist.
Tony Robinson as S. Baldrick, his servant.
Stephen Fry as Melchett in two series, first as Lord Melchett, the sycophantic adviser to Queen Elizabeth I in series two and secondly as General Melchett, a blustering buffoon and presumed descendant in ser... | [
-0.020803748,
0.044500284,
0.016816026,
-0.06461463,
0.055125203,
-0.04341887,
0.021398528,
-0.026440632,
-0.056990646,
-0.03717369,
0.0017843371,
-0.072887465,
0.012625537,
0.005613227,
-0.0585587,
-0.04266188,
-0.03536232,
0.008604019,
-0.03409165,
0.0058937194,
0.08510747,... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | mwitted sidekick in series one and two before a change of character to antagonistic rival Captain Kevin Darling in series four. He also appeared as The Scarlet Pimpernel (alias Lord Topper and Le Comte de Frou Frou) for one episode in the third series, and reprised his role as Darling in Blackadder: Back & Forth.
Hugh ... | [
-0.03053745,
0.06595446,
0.020148283,
-0.0700297,
0.052388217,
-0.035577875,
0.05450627,
-0.03967992,
-0.03378155,
-0.0016036184,
0.061557494,
-0.04182478,
0.07120937,
0.027775943,
-0.011361058,
-0.0016371318,
0.007868957,
0.08032502,
-0.07807292,
-0.006323987,
-0.015590454,
... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | rs" Partridge and then as Prince Ludwig the Indestructible in the final instalment of Blackadder II. He reprised his role as George in Blackadder: Back & Forth.
Miranda Richardson was only a regular cast member for series two, in which she played Queen Elizabeth I, reprising the role in Blackadder's Christmas Carol and... | [
-0.018207243,
-0.016071495,
0.013722174,
0.00746844,
0.01303473,
0.015978057,
-0.034812674,
-0.03022082,
-0.006227037,
-0.015457468,
-0.01135283,
-0.03985838,
-0.025882583,
-0.0022375286,
-0.0009994628,
0.04818779,
0.013448532,
0.08970137,
-0.10278282,
0.017032582,
0.01055859... |
4326 | https://en.wikipedia.org/wiki/Blackadder | Blackadder | eneral Hospital" from the fourth. She reappeared as Queenie and additional characters in Christmas Carol and Back and Forth.
Non-recurring cast
Brian Blessed, Elspet Gray and Robert East appeared in all six episodes of the first series as the Black Adder's father, mother and brother respectively. Gray had also appeare... | [
-0.06896759,
0.0044528013,
-0.0009098761,
-0.05779831,
0.040231094,
0.004635793,
0.008227855,
-0.011887692,
-0.018570283,
0.0067978078,
-0.0011657258,
-0.019803783,
-0.022352114,
0.018570283,
-0.018163634,
0.0021111835,
-0.0380623,
0.024276916,
-0.07124482,
-0.0013732859,
-0.... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.